#include<bits/stdc++.h>
using namespace std;
const int N = 100001;

int n;
vector<int> edges[N];
int fath[N];
bool suc[N];

void dfs(int cur){
    bool is_leaf = true;
    int cnt = 0;
    for(auto son:edges[cur]){
        if(son==fath[cur]) continue;
        fath[son] = cur;
        is_leaf = false;
        dfs(son);
        if(suc[son]) cnt++;
        if(cnt>=2){
            suc[cur] = true;
        }
    }
    if(is_leaf) suc[cur] = true;
}

int main(){
    scanf("%d",&n);
    for(int i=1;i<n;i++){
        int s,t;
        scanf("%d%d",&s,&t);
        edges[s].emplace_back(t);
        edges[t].emplace_back(s);
    }
    if(n==1){
        printf("Wasted.\n");
        return 0;
    }
    if(edges[1].size()==1){
        printf("You win, temporarily.\n");
        return 0;
    }
    fath[1] = 0;
    memset(suc,0,sizeof(suc));
    dfs(1);
    if(suc[1]){
        printf("You win, temporarily.\n");
    }else{
        printf("Wasted.\n");
    }
    return 0;
}